Parallel algorithms for computing sparse matrix permanents
نویسندگان
چکیده
منابع مشابه
Computing sparse permanents faster
Bax and Franklin (2002) gave a randomized algorithm for exactly computing the permanent of any n × n zero-one matrix in expected time exp [
متن کاملCombinatorial Algorithms for Parallel Sparse Matrix Distributions
Combinatorial algorithms have long played a crucial enabling role in parallel computing. An important problem in sparse matrix computations is how to distribute the sparse matrix and vectors among processors. We review graph, bipartite graph, and hypergraph models for both 1d (row or column) distributions and 2d distributions. A valuable tool is hypergraph partitioning. We present results using...
متن کاملA hybrid algorithm for computing permanents of sparse matrices
The permanent of matrices has wide applications in many fields of science and engineering. It is, however, a #P-complete problem in counting. The best-known algorithm for computing the permanent, which is due to Ryser [Combinatorial Mathematics, The Carus Mathematical Monographs, vol. 14, Mathematical Association of America, Washington, DC, 1963], runs O(n2 ) in time. It is possible to speed up...
متن کاملA load balancing strategy for parallel computation of sparse permanents
The research in parallel machine scheduling in combinatorial optimization suggests that the desirable parallel efficiency could be achieved when the jobs are sorted in the non-increasing order of processing times. In this paper, we find that the time spending for computing the permanent of a sparse matrix by hybrid algorithm is strongly correlated to its permanent value. A strategy is introduce...
متن کاملHighly Scalable Parallel Algorithms for Sparse Matrix Factorization
In this paper, we describe scalable parallel algorithms for sparse matrix factorization, analyze their performance and scalability, and present experimental results for up to 1024 processors on a Cray T3D parallel computer. Through our analysis and experimental results, we demonstrate that our algorithms substantially improve the state of the art in parallel direct solution of sparse linear sys...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES
سال: 2019
ISSN: 1303-6203
DOI: 10.3906/elk-1904-135